Existence, algorithms, and asymptotics of direct product decompositions, I

نویسنده

  • James B. Wilson
چکیده

Direct products of finite groups are a simple method to construct new groups from old ones. A difficult problem by comparison is to prove a generic group G is indecomposable, or locate a proper nontrivial direct factor. To solve this problem it is shown that in most circumstances G has a proper nontrivial subgroup M such that every maximal direct product decomposition Q of G/M induces a unique set H of subgroups of G where |H| ≤ |Q| and for each H ∈ H, the nonabelian direct factors of H are direct factors of G. In particular, G is indecomposable if |H| = 1 and M is contained in the Frattini subgroup of G. This “local-global” property of direct products can be applied inductively to M and G/M so that the existence of a proper nontrivial direct factor depends on the direct product decompositions of the chief factors of G. Chief factors are characteristically simple groups and therefore a direct product of isomorphic simple groups. Thus a search for proper direct factors of a group of size N is reduced from the global search through all NO(log N) normal subgroups to a search of O(log N) local instances induced from chief factors. There is one family of groups G where no subgroup M admits the localglobal property just described. These are p-groups of nilpotence class 2. There are p2n 3/27+Ω(n2) isomorphism types of class 2 groups with order pn [BNV], which prevents a case-by-case study. Also these groups arise in the course of the induction described above so they cannot be ignored. To identify direct factors for nilpotent groups of class 2, a functor is introduced to the category of commutative rings. The result being that indecomposable p-groups of class 2 are identified with local commutative rings. This relationship has little to do with the typical use of Lie algebras for p-groups and is one of the essential and unexpected components of this study. These results are the by-product of an efficient polynomial-time algorithm to prove indecomposability or locate a proper nontrivial direct factor. The theorems also explain how many isomorphism types of indecomposable groups exists of a given order and how many direct factors a group can have. These two topics are explained in a second part to this paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Product Decompositions of Lattices , Closures andRelation

In this paper we study the direct product decompositions of closure operations and lattices of closed sets. We characterize the direct product decompositions of lattices of closed sets in terms of closure operations, and nd those decompositions of lattices which correspond to the decompositions of closures. If a closure on a nite set is represented by its implication base (i.e. a binary relatio...

متن کامل

Canonical tree-decompositions of finite graphs I. Existence and algorithms

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the...

متن کامل

BEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES

We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...

متن کامل

Direct product decompositions of lattices, closures and relation schemes

In this paper we study direct product decompositions of closure operations and lattices of closed sets. We characterize direct product decompositions of lattices of closed sets in terms of closure operations, and find those decompositions of lattices which correspond to the decompositions of closures. If a closure on a finite set is represented by its implication base (i.e. a binary relation on...

متن کامل

Quasi-Primary Decomposition in Modules Over Proufer Domains

In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Groups Complexity Cryptology

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012